منابع مشابه
Tolerant, Classical, Strict
In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classic...
متن کاملOn the Strict Tolerant Conception of Truth
We discuss four distinct semantic consequence relations which are based on Strong Kleene theories of truth and which generalize the notion of classical consequence to 3-valued logics. Then we set up a uniform signed tableau calculus (the strict-tolerant calculus) which we show to be sound and complete with respect to each of the four semantic consequence relations. The signs employed by our cal...
متن کاملInconsistency-Tolerant Reasoning with Classical Logic and Large Databases
Real-world automated reasoning systems must contend with inconsistencies and the vast amount of information stored in relational databases. In this paper, we introduce compilation techniques for inconsistency-tolerant reasoning over the combination of classical logic and a relational database. Our resolution-based algorithms address a quantifier-free, function-free fragment of first-order logic...
متن کاملClassical leakage resilience from fault-tolerant quantum computation
Physical implementations of cryptographic algorithms leak information, which makes them vulnerable to so-called side-channel attacks. The problem of secure computation in the presence of leakage is generally known as leakage resilience. In this work, we establish a connection between leakage resilience and fault-tolerant quantum computation. We first prove that for a general leakage model, ther...
متن کاملMaking Classical Ground State Spin Computing Fault-Tolerant
We examine a model of classical deterministic computing in which the ground state of the classical system is a spatial history of the computation. This model is relevant to quantum dot cellular automata as well as to recent universal adiabatic quantum computing constructions. In its most primitive form, systems constructed in this model cannot compute in an error-free manner when working at non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Philosophical Logic
سال: 2010
ISSN: 0022-3611,1573-0433
DOI: 10.1007/s10992-010-9165-z